The Complexity of Diagnosability and Opacity Verification for Petri Nets
نویسندگان
چکیده
Diagnosability and opacity are two well-studied problems in discrete-event systems. We revisit these two problems with respect to expressiveness and complexity issues. We first relate different notions of diagnosability and opacity. We consider in particular fairness issues and extend the definition of Germanos et al. [ACM TECS, 2015] of weakly fair diagnosability for safe Petri nets to general Petri nets and to opacity questions. Second, we provide a global picture of complexity results for the verification of diagnosability and opacity. We show that diagnosability is NL-complete for finite state systems, PSPACE-complete for safe convergent Petri nets (even with fairness), and EXPSPACE-complete for general Petri nets without fairness, while non diagnosability is inter-reducible with reachability when fault events are not weakly fair. Opacity is ESPACE-complete for safe Petri nets (even with fairness) and undecidable for general Petri nets already without fairness.
منابع مشابه
Distributed Diagnosability Analysis with Petri Nets
We propose a framework to distributed diagnosability analysis of concurrent systems modeled with Petri nets as a collection of components synchronizing on common observable transitions, where faults can occur in several components. The diagnosability analysis of the entire system is done in parallel by verifying the interaction of each component with the fault free versions of the other compone...
متن کاملA rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملHybrid Time Delay Petri Nets as a Mathematical Novel Tool to Model Dynamic System with Current Sample Time
The existing modeling methods using Petri Nets, have been successfully applied to model and analyze dynamic systems. However, these methods are not capable of modeling all dynamic systems such as systems with the current sample time signals, systems including various subsystems and multi-mode systems. This paper proposes Hybrid Time Delay Petri Nets (HTDPN) to solve the problem. In ...
متن کاملOn K-diagnosability of Petri nets via integer linear programming
This paper deals with the problem of diagnosability of a fault after the firing of a finite number events (i.e., K-diagnosability). This problemcorresponds to diagnosability of a faultwithin a finite delay in the context of discrete event systems. The main contribution of this paper is a necessary and sufficient condition for K-diagnosability of bounded nets. The proposed approach exploits the ...
متن کاملA New Approach for Diagnosability Analysis of Petri Nets Using Veri er Nets
In this paper we analyze the diagnosability properties of labeled Petri nets. We consider the standard notion of diagnosability of languages, requiring that every occurrence of an unobservable fault event be eventually detected, as well as the stronger notion of diagnosability in K steps, where the detection must occur within a xed bound of K event occurrences after the fault. We give necessary...
متن کامل